منابع مشابه
Forkable Strings are Rare
A fundamental combinatorial notion related to the dynamics of the Ouroboros proof-of-stake blockchain protocol is that of a forkable string. The original analysis of the protocol [2] established that the probability that a string of length n is forkable, when drawn from a binomial distribution with parameter (1 − )/2, is exp(−Ω(√n)). In this note we provide an improved estimate of exp(−Ω(n)). D...
متن کاملUnpredictable strings are collectives
In [Z] we defined the notion of an “inference method” which given a finite binary string guesses its continuation. We showed that a special class of these inference methods could be used to construct a very general theory of confirmation. In this paper we investigate the class of strings which are unpredictable with respect to these inference method-that is, infinite strings which are such that...
متن کاملStrings and branes are waves
We examine the equations of motion of double field theory and the duality manifest form of M-theory. We show the solutions of the equations of motion corresponding to null waves correspond to strings or membranes from the usual spacetime perspective. A Goldstone mode analysis of the null wave solution in double field theory produces the equations of motion of the duality manifest string.
متن کاملAre Glueballs Knotted Closed Strings?
Glueballs have a natural interpretation as closed strings in Yang-Mills theory. Their stability requires that the string carries a nontrivial twist, or then it is knotted. Since a twist can be either left-handed or right-handed, this implies that the glueball spectrum must be degenerate. This degeneracy becomes consistent with experimental observations, when we identify the ηL(1410) component o...
متن کاملHow Many Strings Are Easy to Predict?
It is well known in the theory of Kolmogorov complexity that most strings cannot be compressed; more precisely, only exponentially few (Θ(2n−m)) binary strings of length n can be compressed by m bits. This paper extends the ‘incompressibility’ property of Kolmogorov complexity to the ‘unpredictability’ property of predictive complexity. The ‘unpredictability’ property states that predictive com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Physics, Astrophysics and Cosmology
سال: 2010
ISSN: 1991-3915
DOI: 10.9751/tpac.3400-016